Statistical Hyperbolicity in Teichmüller Space

Curvature and rank of Teichmüller space

Let S be a surface with genus g and n boundary components and let d(S) = 3g − 3 + n denote the number of curves in any pants decomposition of S. We employ metric properties of the graph of pants decompositions CP(S) prove that the Weil-Petersson metric on Teichmüller space Teich(S) is Gromov-hyperbolic if and only if d(S) ≤ 2. When d(S) ≥ 3 the Weil-Petersson metric has higher rank in the sense...

Elliptic Actions on Teichmüller Space

Fast approximation and exact computation of negative curvature parameters of graphs

In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity. Our main contribution in this note is a new characterization of hyperbolicity for graphs (and for complete geodesic metric ...

Distortion of the Hyperbolicity Constant of a Graph

If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δneighborhood of the union of the other two sides, for every geodesic triangle T in X. We denote by δ(X) the sharp hyperbolicity constant of X, i.e., δ(X) ...

Hyperbolicity Measures "Democracy" in Real-World Networks

In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a large...